Global convergence of a trust-region algorithm for inequality constrained optimization
نویسندگان
چکیده
منابع مشابه
A trust region algorithm for constrained optimization
We review the main techniques used in trust region algorithms for nonlinear constrained optimization. 1. Trust Region Idea Constrained optimization is to minimize a function subject to finitely many algebraic equation and inequality conditions. It has the following form
متن کاملA Trust-Region Algorithm for Global Optimization
We consider the global minimization of a bound-constrained function with a so-called funnel structure. We develop a two-phase procedure that uses sampling, local optimization, and Gaussian smoothing to construct a smooth model of the underlying funnel. The procedure is embedded in a trust-region framework that avoids the pitfalls of a fixed sampling radius. We present a numerical comparison to ...
متن کاملA Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
This work presents a global convergence theory for a broad class of trust-region algorithms for the smooth nonlinear programming problem with equality constraints. The main result generalizes Powell's 1975 result for unconstrained trust-region algorithms. The trial step is characterized by very mild conditions on its normal and tangential components. The normal component need not be computed ac...
متن کاملA New Convergence Theory for Trust-Region Algorithm for Solving Constrained Optimization Problems
In this paper, we propose a new trust-region algorithm for solving a constrained optimization problem with equality and inequality constraints. In this algorithm, an active-set technique is used to convert the constrained optimization problem with equality and inequality constraints to equality constrained optimization problem. A projected Hessian technique is used together with a conjugate gra...
متن کاملOn the Convergence of a Trust Region SQP Algorithm for Nonlinearly Constrained Optimization Problems
In (Boggs, Tolle and Kearsley 1994b) the authors introduced an eeective algorithm for general large scale nonlinear programming problems. In this paper we describe the theoretical foundation for this method. The algorithm is based on a trust region, sequential quadratic programming (SQP) technique and uses a special auxiliary function, called a merit function or line-search function, for assess...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hokkaido Mathematical Journal
سال: 2001
ISSN: 0385-4035
DOI: 10.14492/hokmj/1350911927